Improving k-Nearest Neighbor Rule: Using Geometrical Neighborhoods and Manifold-based metrics
نویسنده
چکیده
Sample weighting and variations in neighborhood or data-dependent distance metric definitions are three principal directions considered for improving k-NN classification technique. Recently, manifold-based distance metrics attracted considerable interest and computationally less demanding approximations are developed. However, a careful comparison of these alternative approaches is missing. In this study, an extensive comparison is firstly performed for three alternative neighborhood definitions and four manifold-based distance measures. Then, a novel computationally less demanding feature line based method is proposed which exploits geometrical neighborhoods of test samples for feature line construction. Experimental results have shown that the improvements achieved by majority of the existing schemes are not considerable. It is also verified that the proposed scheme surpasses other computationally less demanding manifold-based schemes. keywords: nearest neighbor classifier; geometrical neighborhood definition; manifold-based metrics; interpolation inaccuracy; extrapolation inaccuracy
منابع مشابه
New Neighborhood Based Classification Rules for Metric Spaces and Their Use in Ensemble Classification
The k-nearest-neighbor rule is a well known pattern recognition technique with very good results in a great variety of real classification tasks. Based on the neighborhood concept, several classification rules have been proposed to reduce the error rate of the k-nearest-neighbor rule (or its time requirements). In this work, two new geometrical neighborhoods are defined and the classification r...
متن کاملImproving Nearest Neighbor Rule with a Simple Adaptive Distance Measure
The k-nearest neighbor rule is one of the simplest and most attractive pattern classification algorithms. However, it faces serious challenges when patterns of different classes overlap in some regions in the feature space. In the past, many researchers developed various adaptive or discriminant metrics to improve its performance. In this paper, we demonstrate that an extremely simple adaptive ...
متن کاملSpherical Classification of Remote Sensing Data
Real data are often characterized by high dimensional feature vectors. However, such data contain redundant information that may not be beneficial for analysis algorithms. As such, feature transformation arises in related fields of study, including geoscientific applications, as a means to capture the few characteristics that are useful for pattern analysis algorithms. In this study, we investi...
متن کاملDiscriminant Adaptive Nearest Neighbor Classification
Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discriminant analysis to estimate an effective metric for computing neighborhoods. We determine the local decision b...
متن کاملEdge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
متن کامل